Method and system of convolutive coding for the transmission of space-time block codes according to the technique termed golden code

ABSTRACT

A method is provided for convolutive coding for the transmission of space-time block codes according to the technique termed Golden Code, in a wireless communication network comprising at least a plurality of transmit antennas. The Golden Code coding is associated with a trellis coded modulation, and the necessary partitioning to the trellis is produced such that, for each partitioning step, a set Γ ∞  is multiplied by at least one element β from the set B k  (k&gt;1) of elements of Az such that: 
 
 B   k   ={XεAz  and | Det ( X )| 2 =2 k }, 
 
the set Γ ∞ , termed “infinite Golden Code”, being a principal ideal of the ring Az as defined by the Golden Code technique.

BACKGROUND

This invention relates to a method of convolutive coding for the transmission of space-time block codes according to the technique termed Golden Code. It also relates to a system implementing such a method.

In a general fashion, the invention is applicable to the field of transmission or radio broadcasting of digital data, or sampled analogue data, in particular in the case of transmission with mobiles or, in an even more general manner, in the case of local wireless networks or not. The invention can in particular, if it is wished, be applied to high data rate wireless transmissions. A first application category relates to cellular communication with mobiles, such as the UMTS, for example. A second application category relates to local wireless networks. A third category is that of future ad hoc networks.

In a more precise manner, this invention is applicable to multi-antenna MIMO (“Multiple Input Multiple Output”) systems implementing space-time block codes of the Golden Code type.

A Space-Time Block Code (STBC) is a finite set Γ of complex matrices (the codewords) having M lines and T columns and in which each component Γ_(it) is the symbol which will be transmitted over the antenna i (1≦i≦M) at the instant t (1≦t≦T). An STBC is square if M=T.

The construction criteria for an STBC as described in particular in the document by V. Tarokh, N. Seshadri and A. R. Calderbank, “Space Time Codes for High Data Rates Wireless Communication: Performance Criterion and Code Construction”, IEEE Transactions on Information Theory, vol. 44, no. 2, March 1998, are as follows:

-   -   The order of diversity (of transmission), marked d, of an STBC         is defined by:         $d = {\underset{\underset{X \neq Y}{X\quad Y\quad ɛ}}{Min}\quad{{rank}\left( {X - Y} \right)}}$

An STBC is of full diversity if the order of diversity is maximum, i.e. d=Min (M, T).

-   -   The coding gain, marked g, of an STBC of full diversity with T≧M         is defined by:         $g = {\underset{\underset{X \neq Y}{X,{Y\quad{ɛ\Gamma}}}}{Min}\sqrt[M]{{Det}\left( {\left( {X - Y} \right)\left( {X - Y} \right)^{H}} \right)}}$

It has been demonstrated that the average error probability by codeword, on a Rayleigh fading channel, is proportional to 1/(gSNR)^(dN) at high Signal to Noise Ratio. In order to maximise the performances of an STBC over this type of channel, it is therefore necessary to maximise the coding gain.

As indicated previously, this invention relates more particularly to a space-time block code of the Golden Code type.

The Golden Code, as defined in the document by J.-C. Belfiore, G. Rekaya and E. Viterbo, “The Golden Code: A 2×2 Full-Rate Space Time Code with Non-Vanishing Determinants”, IEEE Transactions on Information Theory, vol. 44, no. 2, April 2005 is a square STBC with 2 transmit antennas (M=2 and T=2). This code is with full diversity (d=2). It offers the best coding gain as of today. This is the algebraic construction of the Golden Code which can carry out its partitioning.

In order to define the Golden Code, it is necessary to introduce division cyclic algebra (non-switching body), A₀, constructed on the body Q[i, θ] in the following manner: $A_{Q} = \left\{ {{\begin{bmatrix} {a + {b \cdot \theta}} & {c + {d \cdot \theta}} \\ {i\left( {c + {d \cdot \overset{\_}{\theta}}} \right)} & {a + {b \cdot \overset{\_}{\theta}}} \end{bmatrix}\quad{with}\quad a},b,c,{d \in {Q\lbrack i\rbrack}}} \right\}$ where $\begin{matrix} {{i^{2} = {- 1}},\theta} \\ {= \frac{1 + \sqrt{5}}{2}} \end{matrix}$ and $\overset{\_}{\theta} = \frac{1 - \sqrt{5}}{2}$

The ring, marked A₂, is defined on this algebra while restricting a, b, c and d in the ring of Gauss integers Z[i]: $A_{Z} = \left\{ {{\begin{bmatrix} {a + {b \cdot \theta}} & {c + {d \cdot \theta}} \\ {i\left( {c + {d \cdot \overset{\_}{\theta}}} \right)} & {a + {b \cdot \overset{\_}{\theta}}} \end{bmatrix}\quad{with}\quad a},b,c,{d \in {Z\lbrack i\rbrack}}} \right\}$

The infinite Golden Code, marked Γ_(∞), is a principal ideal of the ring A_(Z) generated by an element a of this ring. It should be noted that if a vectorial instead of a matricial representation is chosen, A_(Z) and therefore the Golden Code are real 8-dimensional lattices. The element α was chosen such that the ideal forms a lattice corresponding to √{square root over (5)}Z⁸. This is why the Golden Code includes a normalisation by 1/√{square root over (5)}. Accordingly: $\Gamma_{\infty} = \left\{ {{\frac{1}{\sqrt{5}}{\alpha\begin{bmatrix} {a + {b \cdot \theta}} & {c + {d \cdot \theta}} \\ {i\left( {c + {d \cdot \overset{\_}{\theta}}} \right)} & {a + {b \cdot \overset{\_}{\theta}}} \end{bmatrix}}\quad{with}\quad a},b,c,{d \in {Z\lbrack i\rbrack}}} \right\}$ where $\alpha = \begin{bmatrix} {1 + i - {i \cdot \theta}} & 0 \\ 0 & {1 + i - {i \cdot \overset{\_}{\theta}}} \end{bmatrix}$

It has been shown that the infinite Golden Code coding gain is 1/√{square root over (5)}. If a finite code is used, it suffices to constrain a, b, c and d to belong to a finite sub-set included in Z[i] (a QAM constellation for example). The fact that the infinite Golden Code corresponds to Z⁸ greatly facilitates binary labelling and “shaping” (the fact of extracting a constellation) while guaranteeing a good Euclidean distance between codewords.

SUMMARY

The purpose of this invention is a novel method for improving the coding gain of a space-time block code of the Golden Code type.

Another purpose of this invention is an information coding system which is particularly efficient in the case of a fading channel.

At least one of the aforementioned objectives is achieved with a method of convolutive coding for the transmission of space-time block codes according to the technique termed Golden Code, in a wireless communication network comprising at least a plurality of transmit antennas. According to the invention, the Golden Code coding is associated with a trellis coded modulation TCM. Moreover, the partitioning necessary to said trellis is carried out such that, for each step of partitioning, a set Γ_(∞) is multiplied by at least one element β from the set B_(k) (k>1) of elements of Az such that: B _(k) ={XεAz and |Det(X) |²=2^(k)}, the set Γ_(∞) termed “infinite Golden Code” being a principal ideal of the ring Az as defined by the Golden Code technique.

With this invention, a modulation technique coded with the Golden Code is advantageously used, and the technique of partitioning the Golden Code in order to obtain the coding gain is used.

In a general fashion, the coding gain of a sequence of STBC codewords can be defined in the manner which follows.

A sequence (X_(k))_(1≦k≦n) of n words from the code STBC Γ (M=2 and T>1) sent one after the other. It is always possible to consider this sequence as a single codeword from an STBC code (M=2 and nT) constituted by the concatenation of the n matrices X_(k). In this case, a coding gain, marked g_(n), for a sequence of length n: $g_{n} = {\underset{\underset{{(X_{k})},{{(Y_{k})} \in \Gamma^{n}}}{{(X_{k})} \neq {(Y_{k})}}}{Min}\sqrt[2]{{Det}{\sum\limits_{k = 1}^{n}{\left( {X_{k} - Y_{k}} \right)\left( {X_{k} - Y_{k}} \right)^{H}}}}}$

By putting Z_(k)=(X_(k)−Y_(k)) and by modifying the indexing on Z_(k) such that the first n₀ Z_(k)'s are all non zero and all the others zero, the following is obtained: ${{Det}\left( {\sum\limits_{k = 1}^{n}{\left( {X_{k} - Y_{k}} \right)\left( {X_{k} - Y_{k}} \right)^{H}}} \right)} = {{Det}\left( {\sum\limits_{k = 1}^{\,^{n}0}{Z_{k}Z_{k}^{H}}} \right)}$

If it is assumed that the STBC F is of maximum diversity and square (as is the case of the Golden Code), if Z_(k) is not zero then Z_(k) is inversible and one can define {tilde over (Z)}_(k)=Det(Z_(k))Z_(k) ⁻¹. It is then easily shown that: ${{Det}\left( {\sum\limits_{k = 1}^{\,^{n}0}{Z_{k}Z_{k}^{H}}} \right)} = {\sum\limits_{k = 1}^{\,^{n}0}{{{Det}\left( {Z_{k}Z_{k}^{H}} \right)}\underset{k = 1}{\overset{\,^{n}0}{+ \sum}}{\sum\limits_{j = {k + 1}}^{\,^{n}0}\quad{{{\overset{\sim}{Z}}_{k}Z_{j}}}_{2}^{2}}}}$ where ∥X∥₂ designates the Frobenius standard (or standard 2) of the matrix X.

If the STBC code considered has an additive group structure (as with the Infinite Golden Code), the coding gain can be rewritten in the following manner: $g_{n} = {\underset{1 \leq n_{0} \leq n}{Min}\quad\underset{\underset{Z_{k \neq 0}}{Z_{k} \in \Gamma}}{Min}\sqrt[2]{{\sum\limits_{k = 1}^{n_{0}}{{Det}\left( {Z_{k}Z_{k}^{H}} \right)}} + {\sum\limits_{k = 1}^{n_{0}}{\sum\limits_{j = {k + 1}}^{n_{0}}\quad{{{\overset{\sim}{Z}}_{k}Z_{j}}}_{2}^{2}}}}}$

The idea of coded modulations is to create a temporal link between the different STBC codewords sent during a sequence in order to increase the coding gain; this corresponds to the case where n₀>2. In this case, our particular interest is in the crossed terms ∥{tilde under (Z)}_(k)Z_(j)∥₂ ² likely to increase the gain considerably. For the case n₀=1, one ensures that the sequences of code words which have only a single non-zero code word, let us say Z_(k) are such that Det(Z_(k)Z_(k) ^(H)) is sufficiently high not to penalise the overall coding gain.

In order to do this, the Trellis Coded Modulation technique TCM is advantageously used. Just as in the case of a Gaussian channel marked AWGN, it is necessary to have a binary labelling which is based on a partitioning of the constellation sent.

In the context of TCM, a partitioning consists of finding from an additive starting group E₀ a decreasing sequence (E_(i)) of sub-groups such that at each partition step the set quotient E_(i)/E_(i+1) has a cardinal (the term used will be order) which is a power of 2 to allow binary labelling.

A good partitioning within the meaning of TCM must allow at the appropriate time a distance criterion within all the sub-sets. In the case of TCM over a Gaussian channel this is a Euclidean distance criterion with minimal squaring even though for an STBC this is the coding gain: ${g\left( E_{i} \right)} = {\underset{\underset{X \neq O}{X \in E_{i}}}{Min}{{Det}\left( {XX}^{H} \right)}}$

For example, still in the context of TCM according to the prior art, FIG. 1 describes a partition chain of Z[i] corresponding to a QAM constellation in the case of the Gaussian channel (AWGN).

This partition chain can be continued for as long as this is necessary in order to label a point of a QAM constellation using bits c₀, c₁, etc. It is important to note that, at each partition level, the square of the Euclidean distance within each sub-set is twice that of the preceding level. Moreover, it will be noted that binary labelling has been made possible owing to the fact that this set is sub-divided into n sub-sets (the order) where n is a power of 2.

This invention is particularly applicable to ideal sets of the Golden Code, these sets being defined as follows.

If β is a non-zero element of A₂ and such that |Det(β)|²>1, the principal ideal to the left of Γ_(∞) generated by β, marked β.Γ_(∞), and the principal ideal to the right of Γ_(∞) generated by β, marked Γ_(∞).β, are defined by: βΓ_(∞) ={βX|XεΓ _(∞)} Γ_(∞) β={Xβ|XεΓ _(∞)}

The ideals to the left and to the right can be distinct because of the non-commutativity of the algebra.

It is easy to demonstrate that these two principal ideals are additive sub-groups (or sub-lattices) of Γ_(∞) which have the following two properties:

The coding gain of each of the ideals equals: ${g\left( {\beta\Gamma}_{\infty} \right)} = {{g\left( {\Gamma_{\infty}\beta} \right)} = {{{{{Det}(\beta)}}{g\left( \Gamma_{\infty} \right)}} = \frac{{{Det}(\beta)}}{\sqrt{5}}}}$

These ideals are of the order |Det(β)|⁴ compared with Γ_(∞), i.e.: Card(Γ_(∞)/βΓ_(∞))=Card(Γ_(∞)/Γ_(∞)β)=|Det(β)|⁴

Advantageously, in this invention, a partitioning of the Golden Code is carried out which is adapted to coded modulations.

As was mentioned previously, in order to use TCM, it is necessary to create a partitioning where, at each step of the partition, a step is sub-divided into a power of 2 sub-sets.

As β is an element of A₂, the determinant of β is in Z[i]. From this, it can be deduced that there is no β such that the principal ideals generated by β would be of order 2 compared with Γ_(∞) (or of an order which is an odd power of 2).

The invention is particularly remarkable by the fact that β's are defined for which the order is a power of 4. One then advantageously introduces the sets B_(k (k≧)1) of elements of A₂ such that their determinant would have for square modulus 2^(k): B _(k) ={XεAz and |Det(X)|²=2^(k)}

None of the B_(k) is empty as $\begin{bmatrix} {i\left( {1 - \theta} \right)} & {1 - \theta} \\ {i\left( {1 - \overset{\_}{\theta}} \right)} & {i\left( {1 - \overset{\_}{\theta}} \right)} \end{bmatrix}^{\kappa}$ belongs to B_(k). It should also be noted that all B_(k) sets are infinite.

If β_(k) is any element of B_(k), the ideal β_(k) Γ_(∞)(or the ideal Γ_(∞)β_(k)) constitutes a sub-lattice of order 4^(k) of Γ_(∞) and coding gain √{square root over (2^(k)/5)}.

Thus, each of the elements of the set Γ_(∞)/β_(k) Γ_(∞) can be indexed by 2 k bits. Using this method a first partition step is carried out which it is sufficient to reiterate in order to obtain as many partitions as necessary.

According to the invention, β can be multiplied at Γ_(∞) by the left or by the right.

According to one preferred characteristic of the invention, one considers: ${\beta = \begin{bmatrix} {i\left( {1 - \theta} \right)} & {i\left( {2 - \theta} \right)} \\ {- \left( {2 - \overset{\_}{\theta}} \right)} & {i\left( {1 - \overset{\_}{\theta}} \right)} \end{bmatrix}},$ β is an element of B₁.

According to another characteristic of the invention, it is also possible to multiply the set Γ_(∞) by an element β′ such that: ${\beta^{\prime} = \begin{bmatrix} {i\quad\theta} & {- \left( {1 - \theta} \right)} \\ {- {i\left( {1 - \overset{\_}{\theta}} \right)}} & {i\overset{\_}{\theta}} \end{bmatrix}},$ β′ is an element of B₁.

According to an advantageous embodiment of the invention, with k=1, a partitioning is carried out in four steps, using eight bits c₀ to C₇ in order to produce the convolutive coding, and these eight convolutive coding bits are coded from four information bits b₀ to b₃ such that: c₀=c₁=c₂=0 c ₃ =xb ₀ +x ² b ₁ +x ³ b ₂ +x ⁴ b ₃

-   -   c₄, c₅, c₆, c₇ being equal respectively to one of the bits b₀ to         b₃.

According to another aspect of the invention, a convolutive coding system is proposed for the transmission of space-time block codes according to the technique termed Golden Code, in a wireless communication network comprising at least a plurality of transmit antennas. According to the invention, the system comprises a convolutive coder receiving bits of information to be transmitted and generating a set of coded bits and a space-time block coder of the Golden Code type, these two coders being implemented such that the space-time block coder of the Golden Code type transmits sequences obeying the following conditions: a convolutive coding by trellis coded modulation TCM, and a partitioning necessary to said trellis such that, for each partitioning step, a set Γ_(∞) is multiplied by at least one element β from the set B_(k) (k>1) of elements of Az such that: B _(k) ={XεAz and |Det(X)|²=2^(k)}, the set Γ_(∞), termed “infinite Golden Code”, being a principal ideal of the ring Az as defined by the Golden Code technique.

BRIEF DESCRIPTION OF THE DRAWINGS

Other advantages and characteristics of the invention will become apparent on examination of the detailed description of an embodiment which is in no way limitative, and the attached diagrams, in which:

FIG. 1 describes a partitioning according to the prior art;

FIG. 2 describes a partitioning in two steps according to the invention;

FIG. 3 is a complete representation of the partitioning of FIG. 2;

FIG. 4 is a compact representation of an example of partitioning in four steps according to the invention;

FIG. 5 illustrates a trellis example for the implementation of the method according to this invention;

FIG. 6 is a comparative graphic representation between an uncoded Golden Code and a Golden Code coded by modulation; and

FIG. 7 is a diagrammatic view of an transmitter system according to the invention.

Examples of the implementation of the method according to this invention will now be described in order to obtain a coding gain by using a coded modulation technique with a space-time block code with two transmit antennas.

FIG. 2 shows a partitioning according to this invention. By considering any two elements β₁ and β₁′ from B₁, it is possible to create a partitioning into 16 of Γ_(∞) in two partition steps. B₁={X εAz and |DetX|²=2}.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

By marking the 4 elements of the set Γ_(∞)/β₁Γ_(∞) (resp. Γ_(∞)/β₁′Γ_(∞)) 0, y₁, y₂ and y₃ (resp. 0, y₁′, y₂′ and y₃′, which will be indexed by the bit doublet (c₀, c₁) (resp. (c₂, c₃)), the partitioning can be represented as illustrated in FIG. 2. Γ_(∞) is the start point. The first partition makes it possible to generate four elements by multiplying β₁ to the left of Γ_(∞). One then obtains, β₁Γ_(∞), β₁Γ_(∞)+y₂, β₁Γ_(∞)+y₁, and β₁Γ_(∞)+y₃. These four elements are coded with two convolutive coding bits c₀ and c₁.

The second partition consists of introducing β′₁ to the left of Γ_(∞) and of generating the following sixteen elements:

[β₁β₁′Γ_(∞), β₁β₁′Γ_(∞)+β₁γ₂′, β₁β₁′Γ_(∞)+β₁γ₁, β₁β₁Γ_(∞)+β₁γ₃′];

[β₁β₁′Γ_(∞)+γ₂,β₁β₁′Γ_(∞)+β₁γ₂′+γ₂,β₁β₁′Γ_(∞)+β₁γ₁′+γ₂,β₁β₁′Γ_(∞)+β₁γ₃′+γ₂];

[β₁β₁′Γ_(∞)+γ₁,β₁β₁′Γ_(∞)+β₁γ₂′+γ₁,β₁β₁′Γ_(∞)+β₁γ₁′+γ₁,β₁β₁′Γ_(∞)+β₁γ₃′+γ₁]

[β₁β₁′Γ_(∞)+γ₃,β₁β₁′γ∞+β₁γ₂′+γ₃,β₁β₁′Γ_(∞)+β₁γ₁′+γ₃,β₁β₁′Γ_(∞)+β₁γ₃′+γ₃].

These sixteen elements are coded with two convolutive coding bits c₂ and c₃ in combination with the bits c₀ and c₁.

This partitioning can be represented in a more compact manner as illustrated in FIG. 3. The coding gains are represented to the right of each partition. By the Golden Code principle, the gain is 1/√{square root over (5)} for Γ_(∞). The first partition shows a coding gain of √{square root over (2)}/√{square root over (5)}. The third partition shows a coding gain of 2/√{square root over (5)}. The gain has thus been multiplied by two with a limited complexity.

Therefore, by using generators in B₁, it is guaranteed that the coding gain will be multiplied by a factor of √{square root over (2)} (1.5 dB) every 2 partition bits.

The choice of elements of B₁ used and the choice of placing the ideal to the left or to the right does not affect the coding gains along the partitioning. On the contrary, these choices influence the gain in crossed terms if n₀>1 and the Euclidean distance criterion (in the case where the code is used over a Gaussian channel). A complete example of construction of a trellis coded modulation applied to a Golden Code will now be described. ${{By}\quad{choosing}\quad\beta} = {{\begin{bmatrix} {i\left( {1 - \theta} \right)} & {i\left( {2 - \theta} \right)} \\ {- \left( {2 - \overset{\_}{\theta}} \right)} & {i\left( {1 - \overset{\_}{\theta}} \right)} \end{bmatrix}\quad{and}\quad\beta^{\prime}} = {\begin{bmatrix} {i\quad\theta} & {- \left( {1 - \theta} \right)} \\ {- {i\left( {1 - \overset{\_}{\theta}} \right)}} & {i\overset{\_}{\theta}} \end{bmatrix}\left( \beta \right.}}$ and β′ are elements of B₁), a partitioning in 4 steps of the Golden Code is constructed as illustrated in FIG. 4.

If any non-zero sequence (Z_(k)) verifies the following conditions:

-   -   n₀=1, then the only non-zero codeword sent belongs to 2.Γ_(∞).     -   n₀>1, then at least one of the codewords marked Z₁ belongs to         β.Γ_(∞) and the other marked Z₂ belongs to β.Γ_(∞).β′.

This demonstrates that the coding gain is 4 (6 dB) with respect to the Golden Code.

In order to construct a sequence which verifies the conditions mentioned previously, a bit coding c₀, c₁ . . . c₇ is used, with a convolutive coding which is described by a trellis (the other bits, the number of which depends on the QAM constellation chosen being uncoded). There are a number of trellises making it possible to construct a sequence verifying these conditions. In particular, the number of transitions per trellis state, which will determine the code efficiency, will influence the complexity of the trellis considerably.

A solution is described here which introduces a trellis somewhat less complex, with 16 states and 16 transitions per state. This gives a yield efficiency of ½. FIG. 5 shows such a trellis. For each state, the transitions which correspond to the sequence of bits c₀, c₁ . . . c₇, represented in the form of an integer from 0 to 255 (c₀ being the least significant bit), are listed from top to bottom.

In reality, the bits c₀, c₁ and c₂ are set to 0. By marking the 4 information bits b₀ . . . b₃, a systematic version of the convolutive coder can be given in the form: c₀=c₁=c₂=0 c ₃ =xb ₀ +x ² b ₁ +x ³ b ₂ +x ⁴ b ₃ c₄=b₀ c₅=b₁ c₆=b₂ c₇=b₃

It being given that four redundancy bits are introduced by the convolutive coding, the performance gain is 3 dB between an uncoded Golden Code and this Golden Code coded by modulation if the comparison is carried out at equal spectral efficiency in accordance with FIG. 6.

An implementation example of a transmitter according to the invention will now be described with respect to FIG. 7. This considers a Golden Code with 64 QAM symbols. As an STBC codeword is constituted by 4 64-QAM symbols, it is labelled over 24 bits, c₀, c₁ . . . c₂₃. The bits c₀ . . . c₇ are bits coded by the convolutive code according to the invention from the 4information bits b₀ . . . b₃. The bits c₈ . . . c₂₃ are themselves information bits directly. The series-parallel converter 1 transmits the information bits b₀ . . . b₃ to the convolutive coder 2 according to the invention, and the information bits b₄ . . . b₁₉ directly to the STBC-Golden Code coder 3.

The STBC coder 3 provides to the two modulators 4 and 5 with a Golden Code 64 QAM codeword from the bits c₀, c₁ . . . c₂₃ by respecting the binary labelling defined by the partitioning of the code. It should be noted that the partitioning does not necessarily have to be extended up to c₂₃ as, from c₈ conventional labelling over a 16 QAM can be used.

Of course the invention is not limited to the examples which have just been described and numerous adjustments can be made to these examples without exceeding the scope of the invention. 

1. A method of convolutive coding for the transmission of space-time block codes according to the technique termed Golden Code, in a wireless communication network comprising at least a plurality of transmit antennas, comprising: the Golden Code coding is associated with a trellis coded modulation TCM, and the necessary partitioning of said trellis is produced such that, for each partitioning step, a set Γ_(∞) is multiplied by at least one element β from the set B_(k) (k>1) of elements of Az such that: B _(k) ={XεAz and |Det(X)|²=2^(k)}, the set Γ_(∞) termed “infinite Golden Code” being a principal ideal of the ring Az as defined by the Golden Code technique.
 2. The method of claim 1, wherein β is multiplied to the left of Γ_(∞).
 3. The method of claim 1, wherein β is multiplied to the right of Γ_(∞).
 4. The method of claim 1, wherein each component of a partition thus created is indexed by 2 k bits of convolutive coding.
 5. The method of claim 1, wherein when: $\beta = \begin{bmatrix} {i\left( {1 - \theta} \right)} & {i\left( {2 - \theta} \right)} \\ {- \left( {2 - \overset{\_}{\theta}} \right)} & {i\left( {1 - \overset{\_}{\theta}} \right)} \end{bmatrix}$ is considered, β is an element of B₁.
 6. The method of claim 1, wherein the set Γ_(∞) is multiplied by an element β′ such that: ${\beta^{\prime} = \begin{bmatrix} {i\quad\theta} & {- \left( {1 - \theta} \right)} \\ {- {i\left( {1 - \overset{\_}{\theta}} \right)}} & {i\overset{\_}{\theta}} \end{bmatrix}},$ where β′ an element of B₁.
 7. The method of claim 1, with k=1, wherein when a partitioning in four steps is carried out, eight bits c₀ to c₇ are used to carry out the convolutive coding, and these convolutive coding bits are coded from four information bits b₀ to b₃ such that: c ₀ =c ₁ =c ₂=0 c ₃ =xb ₀ +x ² b ₁ +x ³ b ₂ +x ⁴ b ₃ c₄, c₅, c₆ and c₇ being respectively equal to one of the bits b₀ to b₃.
 8. A system of convolutive coding for the implementation of a method according to claim 1, for the transmission of space-time block codes according to the technique termed Golden Code, in a wireless communication network comprising at least a plurality of transmit antennas; further comprising a convolutive coder receiving information bits to be transmitted and generating a set of coded bits, a space-time block coder of the Golden Code type, these two coders being implemented such that the space-time block coder of the Golden Code type transmits sequences obeying the following conditions: a convolutive coding by trellis coded modulation TCM, and a partitioning necessary to said trellis such that, for each partitioning step, a set Γ_(∞) is multiplied by at least one element β from the set B_(k) (k>1) of elements from Az such that: B _(k) ={X εAz and |Det(X)|²=2^(k)}, the set Γ_(∞), termed “infinite Golden Code”, being a principal ideal of the ring Az as defined by the Golden Code technique. 